Superintelligence cannot be contained: Lessons from Computability Theory
نویسندگان
چکیده
Manuel Alfonseca,1 Manuel Cebrian,2 Antonio Fernandez Anta,3 Lorenzo Coviello,4 Andres Abeliuk,5 and Iyad Rahwan6 Escuela Politécnica Superior, Universidad Autónoma de Madrid, Madrid, Spain Data61 Unit, Commonwealth Scientific and Industrial Research Organisation, Melbourne, Victoria, Australia IMDEA Networks Institute, Madrid, Spain Google, USA Melbourne School of Engineering, University of Melbourne, Melbourne, Australia The Media Lab, Massachusetts Institute of Technology, Cambridge, MA 02139, USA
منابع مشابه
Definability and global degree theory
Gödel’s work [Gö34] on undecidable theories and the subsequent formalisations of the notion of a recursive function ([Tu36], [Kl36] etc.) have led to an ever deepening understanding of the nature of the non-computable universe (which as Gödel himself showed, includes sets and functions of everyday significance). The nontrivial aspect of Church’s Thesis (any function not contained within one of ...
متن کاملInformation Theory and Computational Thermodynamics: Lessons for Biology from Physics
We survey a few aspects of the thermodynamics of computation, connecting information, thermodynamics, computability and physics. We suggest some lines of research into how information theory and computational thermodynamics can help us arrive at a better understanding of biological processes. We argue that while a similar connection between information theory and evolutionary biology seems to b...
متن کاملComputability and Differential Fields: a Tutorial
Computability theory applies a rigorous definition of the notion of an algorithm to determine which mathematical functions can be computed and which cannot. The main concepts in this area date back to Alan Turing, who during the 1930’s gave the definition of what is now called a Turing machine, along with its generalization, the oracle Turing machine. In the ensuing seventy years, mathematician...
متن کاملComputability Theory
Nature was computing long before humans started. It is the algorithmic content of the universe makes it an environment we can survive in. On the other hand, computation has been basic to civilisation from the earliest times. But computability? Computability theory is computation with consciousness, and entails the huge step from doing computation to observing and analysing the activity, and und...
متن کاملThe Liar Strategy and Surprises: so What Is the Lucas Critique?a New Perspective from Computability Theory
In a two person game, the Liar strategy falsifies or subverts the predictable outcomes of the other person’s strategy. Following the Gödelian argument of Binmore(1987), we prove that the best response to the Liar strategy in the Nash equilibrium of the game are surprise strategies. Computable game theory permits the surprise/innovation to be modelled by a total computable best response function...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1607.00913 شماره
صفحات -
تاریخ انتشار 2016